0.11/0.17 % Problem : Vampire---4.8_23035 : TPTP v0.0.0. Released v0.0.0. 0.13/0.18 % Command : run_E %s %d THM 0.14/0.40 % Computer : n024.cluster.edu 0.14/0.40 % Model : x86_64 x86_64 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.40 % Memory : 8042.1875MB 0.14/0.40 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.40 % CPULimit : 1440 0.14/0.40 % WCLimit : 180 0.14/0.40 % DateTime : Mon Jul 3 12:45:38 EDT 2023 0.14/0.40 % CPUTime : 0.20/0.52 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.Y7hOtRYxDF/Vampire---4.8_23035 0.20/0.53 # Version: 3.1pre001-ho 0.20/0.54 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.54 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.54 # Starting new_ho_10 with 900s (5) cores 0.20/0.54 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.54 # Starting sh4l with 180s (1) cores 0.20/0.54 # Starting ehoh_best_nonlift_rwall with 180s (1) cores 0.20/0.54 # sh4l with pid 23215 completed with status 0 0.20/0.54 # Result found by sh4l 0.20/0.54 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.54 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.54 # Starting new_ho_10 with 900s (5) cores 0.20/0.54 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.54 # Starting sh4l with 180s (1) cores 0.20/0.54 # No SInE strategy applied 0.20/0.54 # Search class: HHUNS-FFSF00-SFFFFFNN 0.20/0.54 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.54 # Starting new_ho_10 with 98s (1) cores 0.20/0.54 # new_ho_10 with pid 23217 completed with status 0 0.20/0.54 # Result found by new_ho_10 0.20/0.54 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.54 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.54 # Starting new_ho_10 with 900s (5) cores 0.20/0.54 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.54 # Starting sh4l with 180s (1) cores 0.20/0.54 # No SInE strategy applied 0.20/0.54 # Search class: HHUNS-FFSF00-SFFFFFNN 0.20/0.54 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.54 # Starting new_ho_10 with 98s (1) cores 0.20/0.54 # Preprocessing time : 0.001 s 0.20/0.54 # Presaturation interreduction done 0.20/0.54 0.20/0.54 # Proof found! 0.20/0.54 # SZS status Theorem 0.20/0.54 # SZS output start CNFRefutation 0.20/0.54 thf(decl_22, type, ab: $i). 0.20/0.54 thf(decl_23, type, a: $i). 0.20/0.54 thf(decl_24, type, b: $i). 0.20/0.54 thf(decl_25, type, cP: $i > $i > $i > $o). 0.20/0.54 thf(decl_26, type, cPx: $i > $i > $o). 0.20/0.54 thf(decl_27, type, e: $i). 0.20/0.54 thf(cGRP_COMM, conjecture, (((cP @ a @ b @ ab)=>(cP @ b @ a @ ab))<=(((![X1:$i]:((cP @ e @ X1 @ X1))&![X2:$i]:((cP @ X2 @ e @ X2)))&![X3:$i]:((cP @ X3 @ X3 @ e)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((((cP @ X4 @ X3 @ X6)<=>(cPx @ X5 @ X6))<=((cP @ X1 @ X2 @ X4)&(cP @ X2 @ X3 @ X5)))))), file('/export/starexec/sandbox/tmp/tmp.Y7hOtRYxDF/Vampire---4.8_23035', cGRP_COMM)). 0.20/0.54 thf(c_0_1, negated_conjecture, ~(((((![X1:$i]:((cP @ e @ X1 @ X1))&![X2:$i]:((cP @ X2 @ e @ X2)))&![X3:$i]:((cP @ X3 @ X3 @ e)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((((cP @ X1 @ X2 @ X4)&(cP @ X2 @ X3 @ X5))=>((cP @ X4 @ X3 @ X6)<=>(cPx @ X5 @ X6)))))=>((cP @ a @ b @ ab)=>(cP @ b @ a @ ab)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cGRP_COMM])])). 0.20/0.54 thf(c_0_2, negated_conjecture, ![X16:$i, X17:$i, X18:$i, X19:$i, X20:$i, X21:$i, X22:$i, X23:$i, X24:$i]:((((((cP @ e @ X16 @ X16)&(cP @ X17 @ e @ X17))&(cP @ X18 @ X18 @ e))&((~(cP @ X22 @ X21 @ X24)|(cPx @ X23 @ X24)|(~(cP @ X19 @ X20 @ X22)|~(cP @ X20 @ X21 @ X23)))&(~(cPx @ X23 @ X24)|(cP @ X22 @ X21 @ X24)|(~(cP @ X19 @ X20 @ X22)|~(cP @ X20 @ X21 @ X23)))))&((cP @ a @ b @ ab)&~(cP @ b @ a @ ab)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.20/0.54 thf(c_0_3, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X6:$i, X5:$i, X4:$i]:(((cPx @ X4 @ X3)|~((cP @ X1 @ X2 @ X3))|~((cP @ X5 @ X6 @ X1))|~((cP @ X6 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_4, negated_conjecture, ![X1:$i]:((cP @ e @ X1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_5, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:(((cPx @ X1 @ X2)|~((cP @ X3 @ e @ X4))|~((cP @ X4 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.20/0.54 thf(c_0_6, negated_conjecture, ![X1:$i]:((cP @ X1 @ e @ X1)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_7, negated_conjecture, ![X2:$i, X6:$i, X5:$i, X4:$i, X3:$i, X1:$i]:(((cP @ X3 @ X4 @ X2)|~((cPx @ X1 @ X2))|~((cP @ X5 @ X6 @ X3))|~((cP @ X6 @ X4 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_8, negated_conjecture, ![X1:$i]:((cP @ X1 @ X1 @ e)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cPx @ X1 @ X2)|~((cP @ X3 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.20/0.54 thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X3:$i]:(((cP @ X1 @ X2 @ X3)|~((cP @ X4 @ X2 @ X1))|~((cPx @ e @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.20/0.54 thf(c_0_11, negated_conjecture, ![X1:$i]:((cPx @ e @ X1)), inference(spm,[status(thm)],[c_0_9, c_0_6])). 0.20/0.54 thf(c_0_12, negated_conjecture, ![X4:$i, X3:$i, X2:$i, X1:$i]:(((cP @ X1 @ X2 @ X3)|~((cP @ X4 @ X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])). 0.20/0.54 thf(c_0_13, negated_conjecture, ![X2:$i, X1:$i, X4:$i, X3:$i]:(((cPx @ X1 @ X2)|~((cP @ X3 @ e @ X2))|~((cP @ X4 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_3, c_0_6])). 0.20/0.54 thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i]:((cP @ X1 @ e @ X2)), inference(spm,[status(thm)],[c_0_12, c_0_6])). 0.20/0.54 thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X3:$i]:(((cP @ X1 @ X2 @ X3)|~((cP @ X4 @ e @ X1))|~((cPx @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 0.20/0.54 thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i]:(((cPx @ X1 @ X2)|~((cP @ X3 @ X1 @ X4)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])])). 0.20/0.54 thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cP @ X1 @ X2 @ X3)|~((cPx @ X2 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_14])])). 0.20/0.54 thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i]:((cPx @ X1 @ X2)), inference(spm,[status(thm)],[c_0_16, c_0_4])). 0.20/0.54 thf(c_0_19, negated_conjecture, ~((cP @ b @ a @ ab)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.54 thf(c_0_20, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((cP @ X1 @ X2 @ X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])])). 0.20/0.54 thf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])]), ['proof']). 0.20/0.54 # SZS output end CNFRefutation 0.20/0.54 # Parsed axioms : 7 0.20/0.54 # Removed by relevancy pruning/SinE : 0 0.20/0.54 # Initial clauses : 13 0.20/0.54 # Removed in clause preprocessing : 6 0.20/0.54 # Initial clauses in saturation : 7 0.20/0.54 # Processed clauses : 45 0.20/0.54 # ...of these trivial : 0 0.20/0.54 # ...subsumed : 1 0.20/0.54 # ...remaining for further processing : 44 0.20/0.54 # Other redundant clauses eliminated : 0 0.20/0.54 # Clauses deleted for lack of memory : 0 0.20/0.54 # Backward-subsumed : 2 0.20/0.54 # Backward-rewritten : 33 0.20/0.54 # Generated clauses : 101 0.20/0.54 # ...of the previous two non-redundant : 90 0.20/0.54 # ...aggressively subsumed : 0 0.20/0.54 # Contextual simplify-reflections : 0 0.20/0.54 # Paramodulations : 101 0.20/0.54 # Factorizations : 0 0.20/0.54 # NegExts : 0 0.20/0.54 # Equation resolutions : 0 0.20/0.54 # Total rewrite steps : 60 0.20/0.54 # Propositional unsat checks : 0 0.20/0.54 # Propositional check models : 0 0.20/0.54 # Propositional check unsatisfiable : 0 0.20/0.54 # Propositional clauses : 0 0.20/0.54 # Propositional clauses after purity: 0 0.20/0.54 # Propositional unsat core size : 0 0.20/0.54 # Propositional preprocessing time : 0.000 0.20/0.54 # Propositional encoding time : 0.000 0.20/0.54 # Propositional solver time : 0.000 0.20/0.54 # Success case prop preproc time : 0.000 0.20/0.54 # Success case prop encoding time : 0.000 0.20/0.54 # Success case prop solver time : 0.000 0.20/0.54 # Current number of processed clauses : 2 0.20/0.54 # Positive orientable unit clauses : 2 0.20/0.54 # Positive unorientable unit clauses: 0 0.20/0.54 # Negative unit clauses : 0 0.20/0.54 # Non-unit-clauses : 0 0.20/0.54 # Current number of unprocessed clauses: 56 0.20/0.54 # ...number of literals in the above : 102 0.20/0.54 # Current number of archived formulas : 0 0.20/0.54 # Current number of archived clauses : 42 0.20/0.54 # Clause-clause subsumption calls (NU) : 57 0.20/0.54 # Rec. Clause-clause subsumption calls : 45 0.20/0.54 # Non-unit clause-clause subsumptions : 3 0.20/0.54 # Unit Clause-clause subsumption calls : 15 0.20/0.54 # Rewrite failures with RHS unbound : 0 0.20/0.54 # BW rewrite match attempts : 66 0.20/0.54 # BW rewrite match successes : 30 0.20/0.54 # Condensation attempts : 45 0.20/0.54 # Condensation successes : 0 0.20/0.54 # Termbank termtop insertions : 1744 0.20/0.54 0.20/0.54 # ------------------------------------------------- 0.20/0.54 # User time : 0.004 s 0.20/0.54 # System time : 0.004 s 0.20/0.54 # Total time : 0.008 s 0.20/0.54 # Maximum resident set size: 1768 pages 0.20/0.54 0.20/0.54 # ------------------------------------------------- 0.20/0.54 # User time : 0.007 s 0.20/0.54 # System time : 0.004 s 0.20/0.54 # Total time : 0.011 s 0.20/0.54 # Maximum resident set size: 1708 pages 0.20/0.54 % E---3.1 exiting 0.32/0.54 EOF